//2009/10/17 15:20:57
#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

class OrderedNim
{
public:
    string winner(vector <int> layout)
    {
		/*
		 * 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 
		 * 2, 1, 1, 1, 1, 1, 1, 2, 2, 1
        string ret = "Alice";
        for (int i=1; i<layout.size(); i++)
        {
            if (layout[i] >= layout[i-1])
            {
                if (ret == "Alice")
                    ret = "Bob";
                else
                    ret = "Alice";
            }
        }
        return ret;
		*/
		int count = 0;
		for(int i=0; i<layout.size(); i++)
		{
			if(layout[i] != 1) break;
			else count++;
		}
		if(count == layout.size()) count++;
		return count%2==0 ? "Alice" : "Bob";
    }
};
